Finding linking sets

Finding linking sets

We present the most general definition of the linking of sets in a Banach space and discuss necessary and sufficient conditions for sets to link.

Finding Similar Sets

Finding Large Independent Sets

This lecture deals with the problem of proper vertex colorings of graphs. More speciically, we are interested in coloring a given 3-colorable graph with as few colors as we can. It is easy to see that it is NP-Hard to nd a 3 coloring for any given 3-colorable graph-this would enable deciding whether a general graph is 3-colorable. If a polynomial-time algorithm existed for 3-coloring a 3-colora...

Linking Systems of Difference Sets

A linking system of difference sets is a collection of mutually related group difference sets, whose advantageous properties have been used to extend classical constructions of systems of linked symmetric designs. The central problems are to determine which groups contain a linking system of difference sets, and how large such a system can be. All previous results are constructive, and are rest...

Finding Small Stubborn Sets Automatically

State space generation is often needed in the analysis of concurrent and distributed systems. The stubborn set method is one of the techniques that try to alleviate the state space explosion encountered in state space generation. An algorithm for nding a stubborn set having as few enabled transitions as possible is presented. Practicality of the algorithm is motivated with the aid of examples.